منابع مشابه
On Intuitionistic Fuzzy Context-Free Languages
Taking intuitionistic fuzzy sets as the structures of truth values, we propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs, for short) and pushdown automata with final states (IFPDAs). Then we investigate algebraic characterization of intuitionistic fuzzy recognizable languages including decomposition form and representation theorem. By introducing the generalized subset c...
متن کاملAn approach to fuzzy context free languages
The paper studies the relationship among fuzzy context free languages and fuzzy push down automata. The degree of membership of the words to the fuzzy language generated by a context free grammar, calculated in a monoid, introduces an additional burden for the accepting push down weighted automaton. Even in the case of languages accepted by fuzzy deterministic push down automata, the relationsh...
متن کاملIntuitionistic Fuzzy Pushdown Automata and Intuitionistic Fuzzy Context-Free Languages
In this paper intuitionistic fuzzy pushdown automata, acceptance by empty stack and acceptance by final states and their equivalence is proved. It follows that intuitionistic fuzzy pushdown automata with empty stack and IFPDAs are equivalent. We propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs), intuitionistic fuzzy languages generated by IFCFGs. Additionally, we introd...
متن کاملFuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars
Motivated by aspects of robustness in parsing a context-free language, we study generalized fuzzy context-free grammars. These fuzzy context-free K-grammars provide a general framework to describe correctly as well as erroneously derived sentences by a single generating mechanism. They model the situation of making a finite choice out of an infinity of possible grammatical errors during each co...
متن کاملFuzzy context-free languages - Part 2: Recognition and parsing algorithms
In a companion paper [9] we used fuzzy context-free grammars in order to model grammatical errors resulting in erroneous inputs for robust recognizing and parsing algorithms for fuzzy context-free languages. In particular, this approach enables us to distinguish between small errors (“tiny mistakes”) and big errors (“capital blunders”). In this paper we present some algorithms to recognize fuzz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1974
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(74)90678-0